Finite-state techniques are widely used in various areas of Natural Language Processing (NLP). As Kaplan and Kay [12] have argular expressions are the appropriate level of abstract...
d abstract) Benjamin Carle, Paliath Narendran and Colin Scheriff Dept. of Computer Science University at Albany–SUNY Albany, NY 12222 June 19, 2007 In this paper we extend the ...
We concider an extened algebra of regular events (languages) with intersection besides the usual operations. This algebra has the structure of a distributive lattice with monotoni...