Sciweavers

108 search results - page 3 / 22
» Incremental Finite-State Parsing
Sort
View
COLING
1992
13 years 6 months ago
Compiling and Using Finite-State Syntactic Rules
A language-independent framework for syntactic finlte-state parsing is discussed. The article presents a framework, a formalism, a compiler and a parser for grammars written in th...
Kimmo Koskenniemi, Pasi Tapanainen, Atro Voutilain...
ACL
1998
13 years 6 months ago
Locating Noun Phrases with Finite State Transducers
We present a method for constructing, maintaining and consulting a database of proper nouns. We describe noun phrases composed of a proper noun and/or a description of a human occ...
Jean Senellart
CICLING
2007
Springer
13 years 11 months ago
Finite-State Technology as a Programming Environment
Finite-state technology is considered the preferred model for representing the phonology and morphology of natural languages. The attractiveness of this technology for natural lang...
Shuly Wintner
COLING
2002
13 years 4 months ago
Creating a Finite-State Parser with Application Semantics
Parsli is a finite-state (FS) parser which can be tailored to the lexicon, syntax, and semantics of a particular application using a hand-editable declarative lexicon. The lexicon...
Owen Rambow, Srinivas Bangalore, Tahir Butt, Alexi...
IEICET
2006
76views more  IEICET 2006»
13 years 5 months ago
Relationship among Complexities of Individual Sequences over Countable Alphabet
This paper investigates some relations among four complexities of sequence over countably infinite alphabet, and shows that two kinds of empirical entropies and the self-entropy r...
Shigeaki Kuzuoka, Tomohiko Uyematsu