메뉴 건너뛰기




Volumn , Issue , 2007, Pages 49-60

Approximate string matching for geographic names and personal names

Author keywords

[No Author keywords available]

Indexed keywords

APPROXIMATE STRING MATCHING; GEOGRAPHIC INFORMATION RETRIEVAL; MATCHING STRINGS; PERSONAL NAMES; SIMILARITY MEASURE; TEXTUAL DATA;

EID: 77957010567     PISSN: None     EISSN: 21794847     Source Type: Conference Proceeding    
DOI: None     Document Type: Conference Paper
Times cited : (11)

References (20)
  • 6
    • 78449293191 scopus 로고    scopus 로고
    • A comparison of personal name matching: Techniques and practical issues
    • Hong Kong, IEEE
    • Christen, P. (2006). A Comparison of Personal Name Matching: Techniques and Practical Issues. Sixth IEEE International Conference on Data Mining - Workshops, 290-294, Hong Kong, IEEE.
    • (2006) Sixth IEEE International Conference on Data Mining - Workshops , pp. 290-294
    • Christen, P.1
  • 8
    • 33847622632 scopus 로고    scopus 로고
    • Assessing the certainty of locations produced by an address geocoding system
    • Davis Jr., C. A. and Fonseca, F. T. (2007). "Assessing the Certainty of Locations Produced by an Address Geocoding System.," Geoinformatica 11(1): 103-129.
    • (2007) Geoinformatica , vol.11 , Issue.1 , pp. 103-129
    • Davis Jr., C.A.1    Fonseca, F.T.2
  • 10
    • 34250657370 scopus 로고    scopus 로고
    • Semantic expansion of geographic web queries based on natural language positioning expressions
    • Delboni, T. M., Borges, K. A. V., Laender, A. H. F. and Davis Jr., C. A. (2007). "Semantic Expansion of Geographic Web Queries Based on Natural Language Positioning Expressions.," Transactions in GIS 11(3): 377-397.
    • (2007) Transactions in GIS , vol.11 , Issue.3 , pp. 377-397
    • Delboni, T.M.1    Borges, K.A.V.2    Laender, A.H.F.3    Davis Jr., C.A.4
  • 11
    • 0028950887 scopus 로고
    • Probabilistic linkage of large public health data files
    • Jaro, M. A. (1995). "Probabilistic linkage of large public health data files.," Statistics in Medicine 14.
    • (1995) Statistics in Medicine , vol.14
    • Jaro, M.A.1
  • 13
    • 0002619432 scopus 로고
    • Binary codes capable of correcting spurious insertions and deletions of ones
    • Levenshtein, V. I. (1965). "Binary Codes Capable of Correcting Spurious Insertions and Deletions of Ones.," Probl. Inf. Transmission 1: 8-17.
    • (1965) Probl. Inf. Transmission , vol.1 , pp. 8-17
    • Levenshtein, V.I.1
  • 15
    • 0345566149 scopus 로고    scopus 로고
    • A guided tour to approximate string matching
    • Navarro, G. (2001). "A Guided Tour to Approximate String Matching.," ACM Computing Surveys 33(1): 31-88.
    • (2001) ACM Computing Surveys , vol.33 , Issue.1 , pp. 31-88
    • Navarro, G.1
  • 16
    • 35048842887 scopus 로고    scopus 로고
    • Names: A new frontier in text mining
    • Springer
    • Patman, F. and Thompson, P. (2003). Names: a new frontier in text mining. ISI 2003, 27-38, Springer.
    • (2003) ISI 2003 , pp. 27-38
    • Patman, F.1    Thompson, P.2
  • 19
    • 0012866045 scopus 로고    scopus 로고
    • The state of record linkage and current research problems
    • Winkler, W. E. (1999). The state of record linkage and current research problems, Internal Revenue Service: http://www.census.gov/srd/www/byname.html.
    • (1999) Internal Revenue Service
    • Winkler, W.E.1
  • 20
    • 0029271657 scopus 로고
    • Finding approximate matches in large lexicons
    • Zobel, J. and Dart, P. (1995). "Finding Approximate Matches in Large Lexicons.," Software - Practice and Experience 25(3): 331-345.
    • (1995) Software - Practice and Experience , vol.25 , Issue.3 , pp. 331-345
    • Zobel, J.1    Dart, P.2


* 이 정보는 Elsevier사의 SCOPUS DB에서 KISTI가 분석하여 추출한 것입니다.