Applications of finite automata representing large vocabularies
Software—Practice & Experience
Suffix arrays: a new method for on-line string searches
SODA '90 Proceedings of the first annual ACM-SIAM symposium on Discrete algorithms
MARSYAS: a framework for audio analysis
Organised Sound
Error mining in parsing results
ACL-44 Proceedings of the 21st International Conference on Computational Linguistics and the 44th annual meeting of the Association for Computational Linguistics
Computer aided correction and extension of a syntactic wide-coverage lexicon
COLING '08 Proceedings of the 22nd International Conference on Computational Linguistics - Volume 1
The Spanish resource grammar: pre-processing strategy and lexical acquisition
DeepLP '07 Proceedings of the Workshop on Deep Linguistic Processing
The corpus and the lexicon: standardising deep lexical acquisition evaluation
DeepLP '07 Proceedings of the Workshop on Deep Linguistic Processing
Multilingual deep lexical acquisition for HPSGs via supertagging
EMNLP '06 Proceedings of the 2006 Conference on Empirical Methods in Natural Language Processing
GEAF '08 Proceedings of the Workshop on Grammar Engineering Across Frameworks
Automated multiword expression prediction for grammar engineering
MWE '06 Proceedings of the Workshop on Multiword Expressions: Identifying and Exploiting Underlying Properties
Toward the formal verification of a unification system
IEEE Transactions on Systems, Man, and Cybernetics, Part B: Cybernetics
Toward the formal verification of a unification system
IEEE Transactions on Systems, Man, and Cybernetics, Part B: Cybernetics - Special issue on cybernetics and cognitive informatics
Using generation for grammar analysis and error detection
ACLShort '09 Proceedings of the ACL-IJCNLP 2009 Conference Short Papers
Using large-scale parser output to guide grammar development
GEAF '09 Proceedings of the 2009 Workshop on Grammar Engineering Across Frameworks
A generalized method for iterative error mining in parsing results
GEAF '09 Proceedings of the 2009 Workshop on Grammar Engineering Across Frameworks
Chart mining-based lexical acquisition with precision grammars
HLT '10 Human Language Technologies: The 2010 Annual Conference of the North American Chapter of the Association for Computational Linguistics
Enabling adaptation of lexicalised grammars to new domains
AdaptLRTtoND '09 Proceedings of the Workshop on Adaptation of Language Resources and Technology to New Domains
Grammar-driven versus data-driven: which parsing system is more affected by domain shifts?
NLPLING '10 Proceedings of the 2010 Workshop on NLP and Linguistics: Finding the Common Ground
Using unknown word techniques to learn known words
EMNLP '10 Proceedings of the 2010 Conference on Empirical Methods in Natural Language Processing
A machine learning approach to relational noun mining in German
MWE '11 Proceedings of the Workshop on Multiword Expressions: from Parsing and Generation to the Real World
Syntactic language modeling with formal grammars
Speech Communication
Error mining on dependency trees
ACL '12 Proceedings of the 50th Annual Meeting of the Association for Computational Linguistics: Long Papers - Volume 1
Generation for grammar engineering
INLG '12 Proceedings of the Seventh International Natural Language Generation Conference
An automatic approach to treebank error detection using a dependency parser
CICLing'13 Proceedings of the 14th international conference on Computational Linguistics and Intelligent Text Processing - Volume Part I
| Hi-index | 0.00 |
Parsing systems which rely on hand-coded linguistic descriptions can only perform adequately in as far as these descriptions are correct and complete.The paper describes an error mining technique to discover problems in hand-coded linguistic descriptions for parsing such as grammars and lexicons. By analysing parse results for very large unannotated corpora, the technique discovers missing, incorrect or incomplete linguistic descriptions.The technique uses the frequency of n-grams of words for arbitrary values of n. It is shown how a new combination of suffix arrays and perfect hash finite automata allows an efficient implementation.