scholarly journals Application of Improved BM Algorithm in String Approximate Matching

2020 ◽  
Vol 166 ◽  
pp. 576-581
Author(s):  
Ying Duan ◽  
Hua Long ◽  
Yu Quan Qu
2009 ◽  
Vol 31 (5) ◽  
pp. 769-782 ◽  
Author(s):  
P. Bhowmick ◽  
R.K. Pradhan ◽  
B.B. Bhattacharya

2021 ◽  
Vol 44 (1) ◽  
pp. 101-136
Author(s):  
Lidija Iordanskaja ◽  
Igor Mel’čuk

Abstract A formal linguistitic model is presented, which produces, for a given conceptual representation of an extralinguistic situation, a corresponding semantic representation [SemR] that, in its turn, underlies the deep-syntactic representations of four near-synonymous Russian sentences expressing the starting information. Two full-fledged lexical entries are given for the lexemes besporjadki ‘disturbance’ and stolknovenie ‘clash(N)’, appearing in these sentences. Some principles of lexicalization – that is, matching the formal lexicographic definitions to the starting semantic representation in order to produce the deep-syntactic structures of the corresponding sentences – are formulated and illustrated; the problem of approximate matching is dealt with in sufficient detail.


Sign in / Sign up

Export Citation Format

Share Document