{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,10,23]],"date-time":"2024-10-23T07:41:46Z","timestamp":1729669306648,"version":"3.28.0"},"reference-count":14,"publisher":"IEEE","content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2007,10]]},"DOI":"10.1109\/icsmc.2007.4413704","type":"proceedings-article","created":{"date-parts":[[2008,1,4]],"date-time":"2008-01-04T20:52:49Z","timestamp":1199479969000},"page":"492-497","source":"Crossref","is-referenced-by-count":0,"title":["ADtrees for sequential data and n-gram Counting"],"prefix":"10.1109","author":[{"given":"Rob","family":"Van Dam","sequence":"first","affiliation":[]},{"given":"Dan","family":"Ventura","sequence":"additional","affiliation":[]}],"member":"263","reference":[{"key":"13","doi-asserted-by":"publisher","DOI":"10.1145\/1143844.1143941"},{"key":"14","doi-asserted-by":"publisher","DOI":"10.3115\/991886.991994"},{"key":"11","doi-asserted-by":"crossref","first-page":"67","DOI":"10.1613\/jair.453","article-title":"Cached sufficient statistics for efficient machine learning with large datasets","volume":"8","author":"moore","year":"1998","journal-title":"Journal of Artificial Intelligence Research"},{"key":"12","first-page":"495","article-title":"A dynamic adaptation of ad-trees for efficient machine learning on large data sets","author":"komarek","year":"2000","journal-title":"Proceedings of the International Conference on Machine Learning"},{"key":"3","doi-asserted-by":"publisher","DOI":"10.1006\/csla.1999.0128"},{"key":"2","doi-asserted-by":"publisher","DOI":"10.3115\/1626315.1626322"},{"key":"1","doi-asserted-by":"crossref","first-page":"224","DOI":"10.3115\/974147.974178","article-title":"Tnt: A statistical part-of-speech tagger","author":"brants","year":"2000","journal-title":"Proceedings of the 2nd Conference on Applied Natural Language Processing"},{"year":"0","key":"10"},{"key":"7","doi-asserted-by":"publisher","DOI":"10.1002\/0470015721"},{"article-title":"Hash table sizes for storing n-grains for text processing","year":"2000","author":"gu","key":"6"},{"key":"5","doi-asserted-by":"publisher","DOI":"10.1002\/j.1538-7305.1948.tb01338.x"},{"key":"4","doi-asserted-by":"crossref","DOI":"10.1515\/9783110908589","author":"damerau","year":"1971","journal-title":"Markov Models and Linguistic Theory An Experimental Study of a Model for English"},{"key":"9","first-page":"313","article-title":"Building a large annotated corpus of english: The penn treebank","volume":"19","author":"marcus","year":"1994","journal-title":"Computational Linguistics"},{"journal-title":"Foundations of Statistical Natural Language Processing","year":"1999","author":"manning","key":"8"}],"event":{"name":"2007 IEEE International Conference on Systems, Man and Cybernetics","start":{"date-parts":[[2007,10,7]]},"location":"Montreal, QC, Canada","end":{"date-parts":[[2007,10,10]]}},"container-title":["2007 IEEE International Conference on Systems, Man and Cybernetics"],"original-title":[],"link":[{"URL":"http:\/\/xplorestaging.ieee.org\/ielx5\/4413560\/4413561\/04413704.pdf?arnumber=4413704","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,5,6]],"date-time":"2019-05-06T14:59:59Z","timestamp":1557154799000},"score":1,"resource":{"primary":{"URL":"http:\/\/ieeexplore.ieee.org\/document\/4413704\/"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2007,10]]},"references-count":14,"URL":"https:\/\/doi.org\/10.1109\/icsmc.2007.4413704","relation":{},"subject":[],"published":{"date-parts":[[2007,10]]}}}