Syntactic analysis of natural languages based on context-free grammar backbone
The aim of the thesis is to design algorithms and methods for an effective and robust syntactic analysis of natural languages. The algorithms are language-independent, any language with an appropriate grammar can be modeled. The analysis of sentences by the described system is based on context-free...
Uloženo v:
| Hlavní autor: | |
|---|---|
| Další autoři: | |
| Typ dokumentu: | VŠ práce nebo rukopis |
| Jazyk: | Angličtina |
| Vydáno: |
2007
|
| Témata: | |
| On-line přístup: | http://is.muni.cz/th/3541/fi_d/ |
| LEADER | 04490ctm a22009017a 4500 | ||
|---|---|---|---|
| 001 | MUB01000542592 | ||
| 003 | CZ BrMU | ||
| 005 | 20240509104703.0 | ||
| 008 | 080228s2007 xr ||||| |||||||||||eng d | ||
| STA | |a POSLANO DO SKCR |b 2017-05-09 | ||
| 035 | |a (ISMU-VSKP)50421 | ||
| 040 | |a BOD114 |b cze |d BOD018 | ||
| 072 | 7 | |a 81 |x Lingvistika. Jazyky |2 Konspekt |9 11 | |
| 080 | |a 159.95:81'23 |2 MRF | ||
| 080 | |a 81'36 |2 MRF | ||
| 080 | |a 004.421 |2 MRF | ||
| 080 | |a 81'367 |2 MRF | ||
| 100 | 1 | |a Kadlec, Vladimír |% UČO 3541 |* [absolvent FI MU] |4 dis | |
| 245 | 1 | 0 | |a Syntactic analysis of natural languages based on context-free grammar backbone |h [rukopis] / |c Vladimír Kadlec. |
| 260 | |c 2007 | ||
| 300 | |a 107 l. | ||
| 500 | |a Vedoucí práce: Karel Pala. | ||
| 502 | |a Dizertace (Ph.D.)--Masarykova univerzita, Fakulta informatiky, 2008. | ||
| 520 | 2 | 9 | |a The aim of the thesis is to design algorithms and methods for an effective and robust syntactic analysis of natural languages. The algorithms are language-independent, any language with an appropriate grammar can be modeled. The analysis of sentences by the described system is based on context-free grammar for a given language supplemented by context sensitive structures. The internal representation of derivation trees allows applying contextual constraints, e.g. case agreement fulfillment. The result of the constraint application is still stored in the polynomial structure. The evaluation of semantic actions and contextual constraints helps us to reduce a huge number of derivation trees and we are also able to calculate some new information, which is not contained in the context-free part of the grammar. Also n-best trees (according to a tree rank, e.g. probability) can be selected. This is an important feature for linguistics developing a grammar by hand. We describe a robust extensi. |9 eng |
| 650 | 0 | 7 | |a mluvnice |7 ph115331 |2 czenas |
| 650 | 0 | 7 | |a neurolingvistické programování |7 ph123259 |2 czenas |
| 650 | 0 | 7 | |a algoritmy (programování) |7 ph131788 |2 czenas |
| 650 | 0 | 7 | |a syntax |7 ph117044 |2 czenas |
| 650 | 0 | 9 | |a grammar |2 eczenas |
| 650 | 0 | 9 | |a neurolinguistic programming |2 eczenas |
| 650 | 0 | 9 | |a algorithms |2 eczenas |
| 650 | 0 | 9 | |a syntax |2 eczenas |
| 655 | 7 | |a disertace |7 fd132024 |2 czenas | |
| 655 | 9 | |a dissertations |2 eczenas | |
| 658 | |a Informatika (čtyřleté) |b Informatika |c FI D-IN4 IN (IN) |2 CZ-BrMU | ||
| 700 | 1 | |a Pala, Karel, |d 1939-2023 |7 jk01091535 |% UČO 455 |4 ths | |
| 710 | 2 | |a Masarykova univerzita. |b Katedra informačních technologií |4 dgg | |
| 856 | 4 | 1 | |u http://is.muni.cz/th/3541/fi_d/ |
| CAT | |c 20080228 |l MUB01 |h 0450 | ||
| CAT | |c 20080429 |l MUB01 |h 1814 | ||
| CAT | |c 20080429 |l MUB01 |h 1828 | ||
| CAT | |a KREKOVA |b 02 |c 20080519 |l MUB01 |h 1243 | ||
| CAT | |a KREKOVA |b 02 |c 20080519 |l MUB01 |h 1243 | ||
| CAT | |c 20091203 |l MUB01 |h 0206 | ||
| CAT | |c 20091203 |l MUB01 |h 1849 | ||
| CAT | |c 20100428 |l MUB01 |h 1007 | ||
| CAT | |a BATCH-UPD |b 00 |c 20100501 |l MUB01 |h 1148 | ||
| CAT | |a BATCH-UPD |b 00 |c 20100929 |l MUB01 |h 0328 | ||
| CAT | |a POSPEL |b 02 |c 20110504 |l MUB01 |h 0746 | ||
| CAT | |c 20110627 |l MUB01 |h 1910 | ||
| CAT | |c 20110627 |l MUB01 |h 2318 | ||
| CAT | |a batch |b 00 |c 20120324 |l MUB01 |h 0111 | ||
| CAT | |a POSPEL |b 02 |c 20120417 |l MUB01 |h 0803 | ||
| CAT | |a POSPEL |b 02 |c 20120516 |l MUB01 |h 1657 | ||
| CAT | |a BATCH |b 00 |c 20130303 |l MUB01 |h 0950 | ||
| CAT | |a POSPEL |b 02 |c 20130828 |l MUB01 |h 1402 | ||
| CAT | |a POSPEL |b 02 |c 20140109 |l MUB01 |h 1105 | ||
| CAT | |a POSPEL |b 02 |c 20140220 |l MUB01 |h 1323 | ||
| CAT | |a HANAV |b 02 |c 20141110 |l MUB01 |h 1248 | ||
| CAT | |a HANAV |b 02 |c 20141205 |l MUB01 |h 1530 | ||
| CAT | |c 20150901 |l MUB01 |h 1440 | ||
| CAT | |c 20150921 |l MUB01 |h 1401 | ||
| CAT | |a BATCH |b 00 |c 20151225 |l MUB01 |h 2321 | ||
| CAT | |a HANAV |b 02 |c 20160926 |l MUB01 |h 1053 | ||
| CAT | |a HANAV |b 02 |c 20161111 |l MUB01 |h 1657 | ||
| CAT | |a POSPEL |b 02 |c 20161122 |l MUB01 |h 0726 | ||
| CAT | |c 20170301 |l MUB01 |h 1213 | ||
| CAT | |a POSPEL |b 02 |c 20170502 |l MUB01 |h 1324 | ||
| CAT | |c 20170509 |l MUB01 |h 0932 | ||
| CAT | |c 20210614 |l MUB01 |h 0930 | ||
| CAT | |c 20210614 |l MUB01 |h 1919 | ||
| CAT | |a BATCH |b 00 |c 20210724 |l MUB01 |h 1134 | ||
| CAT | |a BATCH-UPD |b 00 |c 20230220 |l MUB01 |h 2353 | ||
| CAT | |a VESELAX |b 02 |c 20240509 |l MUB01 |h 1047 | ||
| LOW | |a POSLANO DO SKCR |b 2017-05-09 | ||
| 994 | - | 1 | |l MUB01 |l MUB01 |m VYSPR |1 FI |a Fakulta informatiky |2 SKLAD |b sklad |3 Diz. práce 2007 |5 42005D2566 |8 20080519 |f 72 |f Týdenní |r 20080519 |
| AVA | |a INF50 |b FI |c sklad |d Diz. práce 2007 |e available |t K dispozici |f 1 |g 0 |h N |i 1 |j SKLAD | ||