- Tytuł:
- An Application of Probabilistic Grammars to Efficient Machne Translation
- Autorzy:
- Skórzewski, Paweł
- Powiązania:
- https://bibliotekanauki.pl/articles/1037598.pdf
- Data publikacji:
- 2010-09-15
- Wydawca:
- Uniwersytet im. Adama Mickiewicza w Poznaniu
- Tematy:
-
a* algorithm
machine translation
natural language parsing
pcfg
probabilistic grammars - Opis:
- In this paper we present one of the algorithms used to parse probabilistic context-free grammars: the A* parsing algorithm, which is based on the A* graph search method. We show an example of application of the algorithm in an existing machine translation system. The existing CYK-based parser used in the Translatica system was modified by applying the A* parsing algorithm in order to examine the possibilities of improving its performance. This paper presents the results of applying the A* algorithm with different heuristic functions and their impact on the performance of the parser.
- Źródło:
-
Investigationes Linguisticae; 2010, 21; 90-98
1426-188X
1733-1757 - Pojawia się w:
- Investigationes Linguisticae
- Dostawca treści:
- Biblioteka Nauki
Artykuł