84 search results - page 5 / 17 » Efficient Enumeration of Regular Languages |
159
click to vote
ICDT
2009
ACM
15 years 10 months ago
2009
ACM
The inclusion of Regular Expressions (REs) is the kernel of any type-checking algorithm for XML manipulation languages. XML applications would benefit from the extension of REs wi...
NIPS
2004
14 years 11 months ago
2004
Statistical language models estimate the probability of a word occurring in a given context. The most common language models rely on a discrete enumeration of predictive contexts ...
DKE
2000
14 years 9 months ago
2000
In this paper we present a natural language interface architecture, which is used for accessing FAQ knowledge bases. Since one of the main obstacles to the efficient use of natura...
COLING
2010
14 years 4 months ago
2010
The Varro toolkit is a system for identifying and counting a major class of regularity in treebanks and annotated natural language data in the form of treestructures: frequently r...
114
Voted
WIA
2000
Springer
15 years 1 months ago
2000
Springer
This paper is a review of some of the major applications of finite-state transducers in Natural Language Processing ranging from morphological analysis to finite-state parsing. The...