Fast, Small and Exact: Infinite-order Language Modelling with Compressed Suffix Trees
Saved in:
| Main Authors: | , , , |
|---|---|
| Format: | Article |
| Language: | English |
| Published: |
The MIT Press
2021-03-01
|
| Series: | Transactions of the Association for Computational Linguistics |
| Online Access: | http://dx.doi.org/10.1162/tacl_a_00112 |
| Tags: |
Add Tag
No Tags, Be the first to tag this record!
|
| _version_ | 1850165208334467072 |
|---|---|
| author | Ehsan Shareghi Matthias Petri Gholamreza Haffari Trevor Cohn |
| author_facet | Ehsan Shareghi Matthias Petri Gholamreza Haffari Trevor Cohn |
| author_sort | Ehsan Shareghi |
| collection | DOAJ |
| format | Article |
| id | doaj-art-4c8bc92828e146d1bacacf78de28f758 |
| institution | OA Journals |
| issn | 2307-387X |
| language | English |
| publishDate | 2021-03-01 |
| publisher | The MIT Press |
| record_format | Article |
| series | Transactions of the Association for Computational Linguistics |
| spelling | doaj-art-4c8bc92828e146d1bacacf78de28f7582025-08-20T02:21:49ZengThe MIT PressTransactions of the Association for Computational Linguistics2307-387X2021-03-01410.1162/tacl_a_00112Fast, Small and Exact: Infinite-order Language Modelling with Compressed Suffix TreesEhsan ShareghiMatthias PetriGholamreza HaffariTrevor Cohnhttp://dx.doi.org/10.1162/tacl_a_00112 |
| spellingShingle | Ehsan Shareghi Matthias Petri Gholamreza Haffari Trevor Cohn Fast, Small and Exact: Infinite-order Language Modelling with Compressed Suffix Trees Transactions of the Association for Computational Linguistics |
| title | Fast, Small and Exact: Infinite-order Language Modelling with Compressed Suffix Trees |
| title_full | Fast, Small and Exact: Infinite-order Language Modelling with Compressed Suffix Trees |
| title_fullStr | Fast, Small and Exact: Infinite-order Language Modelling with Compressed Suffix Trees |
| title_full_unstemmed | Fast, Small and Exact: Infinite-order Language Modelling with Compressed Suffix Trees |
| title_short | Fast, Small and Exact: Infinite-order Language Modelling with Compressed Suffix Trees |
| title_sort | fast small and exact infinite order language modelling with compressed suffix trees |
| url | http://dx.doi.org/10.1162/tacl_a_00112 |
| work_keys_str_mv | AT ehsanshareghi fastsmallandexactinfiniteorderlanguagemodellingwithcompressedsuffixtrees AT matthiaspetri fastsmallandexactinfiniteorderlanguagemodellingwithcompressedsuffixtrees AT gholamrezahaffari fastsmallandexactinfiniteorderlanguagemodellingwithcompressedsuffixtrees AT trevorcohn fastsmallandexactinfiniteorderlanguagemodellingwithcompressedsuffixtrees |