Related Topics
Experts

6

7

8

9

10
Publications (48)

1Alternative approaches for Generating Bodies of Grammar Ruleswhich are one particular way of inducing probabilistic regular languages. We compare two approaches for inducing such languages...

2FiniteState Approximation Of Phrase Structure Grammars1991  Fernando C. N. Pereirais exact for certain contextfree grammars generating regular languages, including all leftlinear and rightlinear contextfree...

3Dynamic Compilation of Weighted ContextFree Grammarsclass of weighted contextfree grammars that represent regular languages. The resulting automata can then be combined with...

4The Replace Operator1995  Lauri Karttunenthan regular languages. A regular relation is a mapping from one regular language to another one. Regular languages correspond...

5Consonant Spreading in Arabic Stems1998  Kenneth R. Beesleyvocalization morphemes) are naturally formalized as regular languages, and stems are formed by the intersection, rather ...

6Formal and Empirical Grammatical Inferencenonregular classes. Angluin 1982 showed a subclass of regular languages (the reversible languages) was identifiable in the limit...

7Using Mazurkiewicz Trace Languages for PartitionBased Morphology2007  François Barthélemynormal form property, because changing the order in regular languages is not a standard operation. Some set operations are...

8Approximating ContextFree Grammars with a FiniteState Calculus1997  Edmund Grimley Evansprograms for manipulating finitestate automata and the regular languages and transducers that they describe. Standard operations...

9On The Decidability Of Functional Uncertainty1993  Rolf Backofendecompositions of the language f 'g ) . But as we use regular languages, there is a finite set of regular decompositions covering...

10The mathematics of language learningphonology and syntax. I Motivation • Some classes of (sub)regular languages • Learning (finite descriptions of) languages • Ide...