Approximate personal name‐matching through finite‐state graphs
Identifieur interne : 000F23 ( Istex/Corpus ); précédent : 000F22; suivant : 000F24Approximate personal name‐matching through finite‐state graphs
Auteurs : Carmen Galvez ; Félix Moya Neg NSource :
- Journal of the American Society for Information Science and Technology [ 1532-2882 ] ; 2007-11.
Abstract
This article shows how finite‐state methods can be employed in a new and different task: the conflation of personal name variants in standard forms. In bibliographic databases and citation index systems, variant forms create problems of inaccuracy that affect information retrieval, the quality of information from databases, and the citation statistics used for the evaluation of scientists' work. A number of approximate string matching techniques have been developed to validate variant forms, based on similarity and equivalence relations. We classify the personal name variants as nonvalid and valid forms. In establishing an equivalence relation between valid variants and the standard form of its equivalence class, we defend the application of finite‐state transducers. The process of variant identification requires the elaboration of: (a) binary matrices and (b) finite‐state graphs. This procedure was tested on samples of author names from bibliographic records, selected from the Library and Information Science Abstracts and Science Citation Index Expanded databases. The evaluation involved calculating the measures of precision and recall, based on completeness and accuracy. The results demonstrate the usefulness of this approach, although it should be complemented with methods based on similarity relations for the recognition of spelling variants and misspellings.
Url:
DOI: 10.1002/asi.20671
Links to Exploration step
ISTEX:CFA76DFD504B587FDD7B41EE1CA75AF02A42E8B8Le document en format XML
<record><TEI wicri:istexFullTextTei="biblStruct"><teiHeader><fileDesc><titleStmt><title xml:lang="en">Approximate personal name‐matching through finite‐state graphs</title><author><name sortKey="Galvez, Carmen" sort="Galvez, Carmen" uniqKey="Galvez C" first="Carmen" last="Galvez">Carmen Galvez</name><affiliation><mods:affiliation>Department of information Science, University of Granada, Campus Cartuja, Colegio Máximo, 18071 Granada, Spain</mods:affiliation></affiliation><affiliation><mods:affiliation>E-mail: cgalvez@urg.es</mods:affiliation></affiliation></author><author><name sortKey="Moya Neg N, Felix" sort="Moya Neg N, Felix" uniqKey="Moya Neg N F" first="Félix" last="Moya Neg N">Félix Moya Neg N</name><affiliation><mods:affiliation>Department of information Science, University of Granada, Campus Cartuja, Colegio Máximo, 18071 Granada, Spain</mods:affiliation></affiliation><affiliation><mods:affiliation>E-mail: felix@urg.es</mods:affiliation></affiliation></author></titleStmt><publicationStmt><idno type="wicri:source">ISTEX</idno><idno type="RBID">ISTEX:CFA76DFD504B587FDD7B41EE1CA75AF02A42E8B8</idno><date when="2007" year="2007">2007</date><idno type="doi">10.1002/asi.20671</idno><idno type="url">https://api.istex.fr/document/CFA76DFD504B587FDD7B41EE1CA75AF02A42E8B8/fulltext/pdf</idno><idno type="wicri:Area/Istex/Corpus">000F23</idno></publicationStmt><sourceDesc><biblStruct><analytic><title level="a" type="main" xml:lang="en">Approximate personal name‐matching through finite‐state graphs</title><author><name sortKey="Galvez, Carmen" sort="Galvez, Carmen" uniqKey="Galvez C" first="Carmen" last="Galvez">Carmen Galvez</name><affiliation><mods:affiliation>Department of information Science, University of Granada, Campus Cartuja, Colegio Máximo, 18071 Granada, Spain</mods:affiliation></affiliation><affiliation><mods:affiliation>E-mail: cgalvez@urg.es</mods:affiliation></affiliation></author><author><name sortKey="Moya Neg N, Felix" sort="Moya Neg N, Felix" uniqKey="Moya Neg N F" first="Félix" last="Moya Neg N">Félix Moya Neg N</name><affiliation><mods:affiliation>Department of information Science, University of Granada, Campus Cartuja, Colegio Máximo, 18071 Granada, Spain</mods:affiliation></affiliation><affiliation><mods:affiliation>E-mail: felix@urg.es</mods:affiliation></affiliation></author></analytic><monogr></monogr><series><title level="j">Journal of the American Society for Information Science and Technology</title><title level="j" type="abbrev">J. Am. Soc. Inf. Sci.</title><idno type="ISSN">1532-2882</idno><idno type="eISSN">1532-2890</idno><imprint><publisher>Wiley Subscription Services, Inc., A Wiley Company</publisher><pubPlace>Hoboken</pubPlace><date type="published" when="2007-11">2007-11</date><biblScope unit="volume">58</biblScope><biblScope unit="issue">13</biblScope><biblScope unit="page" from="1960">1960</biblScope><biblScope unit="page" to="1976">1976</biblScope></imprint><idno type="ISSN">1532-2882</idno></series><idno type="istex">CFA76DFD504B587FDD7B41EE1CA75AF02A42E8B8</idno><idno type="DOI">10.1002/asi.20671</idno><idno type="ArticleID">ASI20671</idno></biblStruct></sourceDesc><seriesStmt><idno type="ISSN">1532-2882</idno></seriesStmt></fileDesc><profileDesc><textClass></textClass><langUsage><language ident="en">en</language></langUsage></profileDesc></teiHeader><front><div type="abstract" xml:lang="en">This article shows how finite‐state methods can be employed in a new and different task: the conflation of personal name variants in standard forms. In bibliographic databases and citation index systems, variant forms create problems of inaccuracy that affect information retrieval, the quality of information from databases, and the citation statistics used for the evaluation of scientists' work. A number of approximate string matching techniques have been developed to validate variant forms, based on similarity and equivalence relations. We classify the personal name variants as nonvalid and valid forms. In establishing an equivalence relation between valid variants and the standard form of its equivalence class, we defend the application of finite‐state transducers. The process of variant identification requires the elaboration of: (a) binary matrices and (b) finite‐state graphs. This procedure was tested on samples of author names from bibliographic records, selected from the Library and Information Science Abstracts and Science Citation Index Expanded databases. The evaluation involved calculating the measures of precision and recall, based on completeness and accuracy. The results demonstrate the usefulness of this approach, although it should be complemented with methods based on similarity relations for the recognition of spelling variants and misspellings.</div></front></TEI><istex><corpusName>wiley</corpusName><author><json:item><name>Carmen Galvez</name><affiliations><json:string>Department of information Science, University of Granada, Campus Cartuja, Colegio Máximo, 18071 Granada, Spain</json:string><json:string>E-mail: cgalvez@urg.es</json:string></affiliations></json:item><json:item><name>Félix Moya‐Anegón</name><affiliations><json:string>Department of information Science, University of Granada, Campus Cartuja, Colegio Máximo, 18071 Granada, Spain</json:string><json:string>E-mail: felix@urg.es</json:string></affiliations></json:item></author><articleId><json:string>ASI20671</json:string></articleId><language><json:string>eng</json:string></language><abstract>This article shows how finite‐state methods can be employed in a new and different task: the conflation of personal name variants in standard forms. In bibliographic databases and citation index systems, variant forms create problems of inaccuracy that affect information retrieval, the quality of information from databases, and the citation statistics used for the evaluation of scientists' work. A number of approximate string matching techniques have been developed to validate variant forms, based on similarity and equivalence relations. We classify the personal name variants as nonvalid and valid forms. In establishing an equivalence relation between valid variants and the standard form of its equivalence class, we defend the application of finite‐state transducers. The process of variant identification requires the elaboration of: (a) binary matrices and (b) finite‐state graphs. This procedure was tested on samples of author names from bibliographic records, selected from the Library and Information Science Abstracts and Science Citation Index Expanded databases. The evaluation involved calculating the measures of precision and recall, based on completeness and accuracy. The results demonstrate the usefulness of this approach, although it should be complemented with methods based on similarity relations for the recognition of spelling variants and misspellings.</abstract><qualityIndicators><score>7.352</score><pdfVersion>1.3</pdfVersion><pdfPageSize>612 x 792 pts (letter)</pdfPageSize><refBibsNative>true</refBibsNative><keywordCount>0</keywordCount><abstractCharCount>1385</abstractCharCount><pdfWordCount>12169</pdfWordCount><pdfCharCount>74779</pdfCharCount><pdfPageCount>17</pdfPageCount><abstractWordCount>196</abstractWordCount></qualityIndicators><title>Approximate personal name‐matching through finite‐state graphs</title><genre.original><json:string>article</json:string></genre.original><genre><json:string>article</json:string></genre><host><volume>58</volume><publisherId><json:string>ASI</json:string></publisherId><pages><total>17</total><last>1976</last><first>1960</first></pages><issn><json:string>1532-2882</json:string></issn><issue>13</issue><subject><json:item><value>personal names</value></json:item><json:item><value>orthography</value></json:item><json:item><value>similarity</value></json:item><json:item><value>equivalence relationships</value></json:item><json:item><value>authors</value></json:item><json:item><value>Research Article</value></json:item></subject><genre><json:string>journal</json:string></genre><language><json:string>unknown</json:string></language><eissn><json:string>1532-2890</json:string></eissn><title>Journal of the American Society for Information Science and Technology</title><doi><json:string>10.1002/(ISSN)1532-2890</json:string></doi></host><publicationDate>2007</publicationDate><copyrightDate>2007</copyrightDate><doi><json:string>10.1002/asi.20671</json:string></doi><id>CFA76DFD504B587FDD7B41EE1CA75AF02A42E8B8</id><fulltext><json:item><original>true</original><mimetype>application/pdf</mimetype><extension>pdf</extension><uri>https://api.istex.fr/document/CFA76DFD504B587FDD7B41EE1CA75AF02A42E8B8/fulltext/pdf</uri></json:item><json:item><original>false</original><mimetype>application/zip</mimetype><extension>zip</extension><uri>https://api.istex.fr/document/CFA76DFD504B587FDD7B41EE1CA75AF02A42E8B8/fulltext/zip</uri></json:item><istex:fulltextTEI uri="https://api.istex.fr/document/CFA76DFD504B587FDD7B41EE1CA75AF02A42E8B8/fulltext/tei"><teiHeader><fileDesc><titleStmt><title level="a" type="main" xml:lang="en">Approximate personal name‐matching through finite‐state graphs</title></titleStmt><publicationStmt><authority>ISTEX</authority><publisher>Wiley Subscription Services, Inc., A Wiley Company</publisher><pubPlace>Hoboken</pubPlace><availability><p>WILEY</p></availability><date>2007</date></publicationStmt><sourceDesc><biblStruct type="inbook"><analytic><title level="a" type="main" xml:lang="en">Approximate personal name‐matching through finite‐state graphs</title><author><persName><forename type="first">Carmen</forename><surname>Galvez</surname></persName><email>cgalvez@urg.es</email><affiliation>Department of information Science, University of Granada, Campus Cartuja, Colegio Máximo, 18071 Granada, Spain</affiliation></author><author><persName><forename type="first">Félix</forename><surname>Moya‐Anegón</surname></persName><email>felix@urg.es</email><affiliation>Department of information Science, University of Granada, Campus Cartuja, Colegio Máximo, 18071 Granada, Spain</affiliation></author></analytic><monogr><title level="j">Journal of the American Society for Information Science and Technology</title><title level="j" type="abbrev">J. Am. Soc. Inf. Sci.</title><idno type="pISSN">1532-2882</idno><idno type="eISSN">1532-2890</idno><idno type="DOI">10.1002/(ISSN)1532-2890</idno><imprint><publisher>Wiley Subscription Services, Inc., A Wiley Company</publisher><pubPlace>Hoboken</pubPlace><date type="published" when="2007-11"></date><biblScope unit="volume">58</biblScope><biblScope unit="issue">13</biblScope><biblScope unit="page" from="1960">1960</biblScope><biblScope unit="page" to="1976">1976</biblScope></imprint></monogr><idno type="istex">CFA76DFD504B587FDD7B41EE1CA75AF02A42E8B8</idno><idno type="DOI">10.1002/asi.20671</idno><idno type="ArticleID">ASI20671</idno></biblStruct></sourceDesc></fileDesc><profileDesc><creation><date>2007</date></creation><langUsage><language ident="en">en</language></langUsage><abstract xml:lang="en"><p>This article shows how finite‐state methods can be employed in a new and different task: the conflation of personal name variants in standard forms. In bibliographic databases and citation index systems, variant forms create problems of inaccuracy that affect information retrieval, the quality of information from databases, and the citation statistics used for the evaluation of scientists' work. A number of approximate string matching techniques have been developed to validate variant forms, based on similarity and equivalence relations. We classify the personal name variants as nonvalid and valid forms. In establishing an equivalence relation between valid variants and the standard form of its equivalence class, we defend the application of finite‐state transducers. The process of variant identification requires the elaboration of: (a) binary matrices and (b) finite‐state graphs. This procedure was tested on samples of author names from bibliographic records, selected from the Library and Information Science Abstracts and Science Citation Index Expanded databases. The evaluation involved calculating the measures of precision and recall, based on completeness and accuracy. The results demonstrate the usefulness of this approach, although it should be complemented with methods based on similarity relations for the recognition of spelling variants and misspellings.</p></abstract><textClass><keywords scheme="Journal Subject"><list><head>index-terms</head><item><term>personal names</term></item><item><term>orthography</term></item><item><term>similarity</term></item><item><term>equivalence relationships</term></item><item><term>authors</term></item></list></keywords></textClass><textClass><keywords scheme="Journal Subject"><list><head>article-category</head><item><term>Research Article</term></item></list></keywords></textClass></profileDesc><revisionDesc><change when="2007-01-29">Received</change><change when="2007-01-30">Registration</change><change when="2007-11">Published</change></revisionDesc></teiHeader></istex:fulltextTEI><json:item><original>false</original><mimetype>text/plain</mimetype><extension>txt</extension><uri>https://api.istex.fr/document/CFA76DFD504B587FDD7B41EE1CA75AF02A42E8B8/fulltext/txt</uri></json:item></fulltext><metadata><istex:metadataXml wicri:clean="Wiley, elements deleted: body"><istex:xmlDeclaration>version="1.0" encoding="UTF-8" standalone="yes"</istex:xmlDeclaration><istex:document><component version="2.0" type="serialArticle" xml:lang="en"><header><publicationMeta level="product"><publisherInfo><publisherName>Wiley Subscription Services, Inc., A Wiley Company</publisherName><publisherLoc>Hoboken</publisherLoc></publisherInfo><doi registered="yes">10.1002/(ISSN)1532-2890</doi><issn type="print">1532-2882</issn><issn type="electronic">1532-2890</issn><idGroup><id type="product" value="ASI"></id></idGroup><titleGroup><title type="main" xml:lang="en" sort="JOURNAL OF THE AMERICAN SOCIETY FOR INFORMATION SCIENCE AND TECHNOLOGY">Journal of the American Society for Information Science and Technology</title><title type="short">J. Am. Soc. Inf. Sci.</title></titleGroup><selfCitationGroup><citation type="ancestor" xml:id="cit1"><journalTitle>Journal of the American Society for Information Science</journalTitle><accessionId ref="info:x-wiley/issn/00028231">0002-8231</accessionId><accessionId ref="info:x-wiley/issn/10974571">1097-4571</accessionId><pubYear year="2000">2000</pubYear><vol>51</vol><issue>14</issue></citation></selfCitationGroup></publicationMeta><publicationMeta level="part" position="200"><doi origin="wiley" registered="yes">10.1002/asi.v58:13</doi><numberingGroup><numbering type="journalVolume" number="58">58</numbering><numbering type="journalIssue">13</numbering></numberingGroup><coverDate startDate="2007-11">November 2007</coverDate></publicationMeta><publicationMeta level="unit" type="article" position="50" status="forIssue"><doi origin="wiley" registered="yes">10.1002/asi.20671</doi><idGroup><id type="unit" value="ASI20671"></id></idGroup><countGroup><count type="pageTotal" number="17"></count></countGroup><titleGroup><title type="articleCategory">Research Article</title><title type="tocHeading1">Research Articles</title></titleGroup><copyright ownership="publisher">Copyright © 2007 Wiley Periodicals, Inc., A Wiley Company</copyright><eventGroup><event type="manuscriptReceived" date="2007-01-29"></event><event type="manuscriptAccepted" date="2007-01-30"></event><event type="publishedOnlineEarlyUnpaginated" date="2007-10-10"></event><event type="firstOnline" date="2007-10-10"></event><event type="publishedOnlineFinalForm" date="2007-10-25"></event><event type="xmlConverted" agent="Converter:JWSART34_TO_WML3G version:2.3.4 mode:FullText source:FullText result:FullText mathml2tex" date="2010-03-30"></event><event type="xmlConverted" agent="Converter:WILEY_ML3G_TO_WILEY_ML3GV2 version:3.8.8" date="2014-01-06"></event><event type="xmlConverted" agent="Converter:WML3G_To_WML3G version:4.1.7 mode:FullText,remove_FC" date="2014-10-30"></event></eventGroup><numberingGroup><numbering type="pageFirst">1960</numbering><numbering type="pageLast">1976</numbering></numberingGroup><subjectInfo><subject href="psi.asis.org/digital/personal+names">personal names</subject><subject href="psi.asis.org/digital/orthography">orthography</subject><subject href="psi.asis.org/digital/similarity">similarity</subject><subject href="psi.asis.org/digital/equivalence+relationships">equivalence relationships</subject><subject href="psi.asis.org/digital/authors">authors</subject></subjectInfo><linkGroup><link type="toTypesetVersion" href="file:ASI.ASI20671.pdf"></link></linkGroup></publicationMeta><contentMeta><countGroup><count type="figureTotal" number="5"></count><count type="tableTotal" number="6"></count><count type="referenceTotal" number="106"></count><count type="wordTotal" number="14661"></count></countGroup><titleGroup><title type="main" xml:lang="en">Approximate personal name‐matching through finite‐state graphs</title></titleGroup><creators><creator xml:id="au1" creatorRole="author" affiliationRef="#af1"><personName><givenNames>Carmen</givenNames><familyName>Galvez</familyName></personName><contactDetails><email>cgalvez@urg.es</email></contactDetails></creator><creator xml:id="au2" creatorRole="author" affiliationRef="#af1"><personName><givenNames>Félix</givenNames><familyName>Moya‐Anegón</familyName></personName><contactDetails><email>felix@urg.es</email></contactDetails></creator></creators><affiliationGroup><affiliation xml:id="af1" countryCode="ES" type="organization"><unparsedAffiliation>Department of information Science, University of Granada, Campus Cartuja, Colegio Máximo, 18071 Granada, Spain</unparsedAffiliation></affiliation></affiliationGroup><abstractGroup><abstract type="main" xml:lang="en"><title type="main">Abstract</title><p>This article shows how finite‐state methods can be employed in a new and different task: the conflation of personal name variants in standard forms. In bibliographic databases and citation index systems, variant forms create problems of inaccuracy that affect information retrieval, the quality of information from databases, and the citation statistics used for the evaluation of scientists' work. A number of approximate string matching techniques have been developed to validate variant forms, based on similarity and equivalence relations. We classify the personal name variants as nonvalid and valid forms. In establishing an equivalence relation between valid variants and the standard form of its equivalence class, we defend the application of finite‐state transducers. The process of variant identification requires the elaboration of: (a) binary matrices and (b) finite‐state graphs. This procedure was tested on samples of author names from bibliographic records, selected from the <b><i>Library and Information Science Abstracts</i></b> and <b><i>Science Citation Index Expanded</i></b> databases. The evaluation involved calculating the measures of precision and recall, based on completeness and accuracy. The results demonstrate the usefulness of this approach, although it should be complemented with methods based on similarity relations for the recognition of spelling variants and misspellings.</p></abstract></abstractGroup></contentMeta></header></component></istex:document></istex:metadataXml><mods version="3.6"><titleInfo lang="en"><title>Approximate personal name‐matching through finite‐state graphs</title></titleInfo><titleInfo type="alternative" contentType="CDATA" lang="en"><title>Approximate personal name‐matching through finite‐state graphs</title></titleInfo><name type="personal"><namePart type="given">Carmen</namePart><namePart type="family">Galvez</namePart><affiliation>Department of information Science, University of Granada, Campus Cartuja, Colegio Máximo, 18071 Granada, Spain</affiliation><affiliation>E-mail: cgalvez@urg.es</affiliation><role><roleTerm type="text">author</roleTerm></role></name><name type="personal"><namePart type="given">Félix</namePart><namePart type="family">Moya‐Anegón</namePart><affiliation>Department of information Science, University of Granada, Campus Cartuja, Colegio Máximo, 18071 Granada, Spain</affiliation><affiliation>E-mail: felix@urg.es</affiliation><role><roleTerm type="text">author</roleTerm></role></name><typeOfResource>text</typeOfResource><genre type="article" displayLabel="article"></genre><originInfo><publisher>Wiley Subscription Services, Inc., A Wiley Company</publisher><place><placeTerm type="text">Hoboken</placeTerm></place><dateIssued encoding="w3cdtf">2007-11</dateIssued><dateCaptured encoding="w3cdtf">2007-01-29</dateCaptured><dateValid encoding="w3cdtf">2007-01-30</dateValid><copyrightDate encoding="w3cdtf">2007</copyrightDate></originInfo><language><languageTerm type="code" authority="rfc3066">en</languageTerm><languageTerm type="code" authority="iso639-2b">eng</languageTerm></language><physicalDescription><internetMediaType>text/html</internetMediaType><extent unit="figures">5</extent><extent unit="tables">6</extent><extent unit="references">106</extent><extent unit="words">14661</extent></physicalDescription><abstract lang="en">This article shows how finite‐state methods can be employed in a new and different task: the conflation of personal name variants in standard forms. In bibliographic databases and citation index systems, variant forms create problems of inaccuracy that affect information retrieval, the quality of information from databases, and the citation statistics used for the evaluation of scientists' work. A number of approximate string matching techniques have been developed to validate variant forms, based on similarity and equivalence relations. We classify the personal name variants as nonvalid and valid forms. In establishing an equivalence relation between valid variants and the standard form of its equivalence class, we defend the application of finite‐state transducers. The process of variant identification requires the elaboration of: (a) binary matrices and (b) finite‐state graphs. This procedure was tested on samples of author names from bibliographic records, selected from the Library and Information Science Abstracts and Science Citation Index Expanded databases. The evaluation involved calculating the measures of precision and recall, based on completeness and accuracy. The results demonstrate the usefulness of this approach, although it should be complemented with methods based on similarity relations for the recognition of spelling variants and misspellings.</abstract><relatedItem type="host"><titleInfo><title>Journal of the American Society for Information Science and Technology</title></titleInfo><titleInfo type="abbreviated"><title>J. Am. Soc. Inf. Sci.</title></titleInfo><genre type="journal">journal</genre><subject><genre>index-terms</genre><topic authorityURI="psi.asis.org/digital/personal+names">personal names</topic><topic authorityURI="psi.asis.org/digital/orthography">orthography</topic><topic authorityURI="psi.asis.org/digital/similarity">similarity</topic><topic authorityURI="psi.asis.org/digital/equivalence+relationships">equivalence relationships</topic><topic authorityURI="psi.asis.org/digital/authors">authors</topic></subject><subject><genre>article-category</genre><topic>Research Article</topic></subject><identifier type="ISSN">1532-2882</identifier><identifier type="eISSN">1532-2890</identifier><identifier type="DOI">10.1002/(ISSN)1532-2890</identifier><identifier type="PublisherID">ASI</identifier><part><date>2007</date><detail type="volume"><caption>vol.</caption><number>58</number></detail><detail type="issue"><caption>no.</caption><number>13</number></detail><extent unit="pages"><start>1960</start><end>1976</end><total>17</total></extent></part></relatedItem><relatedItem type="preceding"><titleInfo><title>Journal of the American Society for Information Science</title></titleInfo><identifier type="ISSN">0002-8231</identifier><identifier type="ISSN">1097-4571</identifier><part><date point="end">2000</date><detail type="volume"><caption>last vol.</caption><number>51</number></detail><detail type="issue"><caption>last no.</caption><number>14</number></detail></part></relatedItem><identifier type="istex">CFA76DFD504B587FDD7B41EE1CA75AF02A42E8B8</identifier><identifier type="DOI">10.1002/asi.20671</identifier><identifier type="ArticleID">ASI20671</identifier><accessCondition type="use and reproduction" contentType="copyright">Copyright © 2007 Wiley Periodicals, Inc., A Wiley Company</accessCondition><recordInfo><recordContentSource>WILEY</recordContentSource><recordOrigin>Wiley Subscription Services, Inc., A Wiley Company</recordOrigin></recordInfo></mods></metadata><serie></serie></istex></record>Pour manipuler ce document sous Unix (Dilib)
EXPLOR_STEP=$WICRI_ROOT/Ticri/CIDE/explor/OcrV1/Data/Istex/Corpus
HfdSelect -h $EXPLOR_STEP/biblio.hfd -nk 000F23 | SxmlIndent | more
Ou
HfdSelect -h $EXPLOR_AREA/Data/Istex/Corpus/biblio.hfd -nk 000F23 | SxmlIndent | more
Pour mettre un lien sur cette page dans le réseau Wicri
{{Explor lien
|wiki= Ticri/CIDE
|area= OcrV1
|flux= Istex
|étape= Corpus
|type= RBID
|clé= ISTEX:CFA76DFD504B587FDD7B41EE1CA75AF02A42E8B8
|texte= Approximate personal name‐matching through finite‐state graphs
}}
| This area was generated with Dilib version V0.6.32. |  |