#### Filter Results:

- Full text PDF available (27)

#### Publication Year

1997

2017

- This year (4)
- Last 5 years (11)
- Last 10 years (15)

#### Publication Type

#### Co-author

#### Journals and Conferences

#### Data Set Used

Learn More

- Jan Daciuk, Stoyan Mihov, Bruce W. Watson, Richard Watson
- Computational Linguistics
- 2000

In this paper, we describe a new method for constructing minimal, deterministic, acyclic finitestate automata from a set of strings. Traditional methods consist of two phases: the first to constructâ€¦ (More)

- Stoyan Mihov, Klaus U. Schulz
- Computational Linguistics
- 2004

The need to correct garbled strings arises in many areas of natural language processing. If a dictionary is available that covers all possible input tokens, a natural set of candidates for correctingâ€¦ (More)

- Klaus U. Schulz, Stoyan Mihov
- International Journal on Document Analysis andâ€¦
- 2002

The Levenshtein distance between two words is the minimal number of insertions, deletions or substitutions that are needed to transform one word into the other. Levenshtein automata of degree n for aâ€¦ (More)

- Christoph Ringlstetter, Klaus U. Schulz, Stoyan Mihov
- Computational Linguistics
- 2006

Since the Web by far represents the largest public repository of natural language texts, recent experiments, methods, and tools in the area of corpus linguistics often use the Web as a corpus. Forâ€¦ (More)

- Stoyan Mihov, Denis Maurel
- CIAA
- 2000

- Boyka Aneva, D. Arnaudon, A. Chakrabarti, V. K. Dobrev, Stoyan Mihov

Combined (q, h)-deformations proposed by Kupershmidt and Ballesterosâ€“ Herranzâ€“Parashar are studied. In each case a transformation is shown to lead to an equivalent, standard, pure q-deformation. Weâ€¦ (More)

- Stefan Gerdjikov, Stoyan Mihov, Petar Mitankin, Klaus U. Schulz
- ArXiv
- 2013

We present a new efficient method for approximate search in electronic lexica. Given an input string (the pattern) and a similarity threshold, the algorithm retrieves all entries of the lexicon thatâ€¦ (More)

- Stoyan Mihov, Klaus U. Schulz, Christoph Ringlstetter, Veselka Dojchinova, Vanja Nakova
- Eighth International Conference on Documentâ€¦
- 2005

We describe a new corpus collected for comparative evaluation of OCR-software and postcorrection techniques. The corpus is freely available for academic groups and use. The major part of the corpusâ€¦ (More)

- Veselka Dojchinova, Stoyan Mihov
- AIMSA
- 2004

- Svetla Koeva, Stoyan Mihov, Tinko Tinchev, S. Koeva, Tinko Tinchev, Slavy Mihov
- 2004

This paper presents a brief description of the semantic relations included in the Bulgarian wordnet. A complete and decidable formal logic for the wordnet structure is also proposed. This logicâ€¦ (More)