开通博客赚积分
发布资源赚积分
分类

源码开发语言/平台
当前位置：首页 > 源码/资料 > 多国语言处理 > 查看源码
Result.cpp
资源名称：ictclas_Source_Code.zip　[点击查看]
上传用户：chen_dj
上传日期：2013-04-22
资源大小：111k
文件大小：16k
源码类别：

多国语言处理

开发平台：

C/C++

Result.cpp：源码内容
  1. // Result.cpp: implementation of the CResult class.
  2. //
  3. //////////////////////////////////////////////////////////////////////
  5. #include "stdafx.h"
  6. #include "Result.h"
  7. #include <string.h>
  8. #include <stdio.h>
  9. #include <math.h>
  10. #include "..\Utility\Utility.h"
  11. //////////////////////////////////////////////////////////////////////
  12. // Construction/Destruction
  13. //////////////////////////////////////////////////////////////////////
  15. CResult::CResult()
  16. {
  17. //malloc buffer
  18. m_pResult=new PWORD_RESULT[MAX_SEGMENT_NUM];
  19. for(int i=0;i<MAX_SEGMENT_NUM;i++)
  20. {
  21. m_pResult[i]=new WORD_RESULT[MAX_WORDS];
  22. }
  24. m_dictCore.Load("data\coreDict.dct");
  25. m_POSTagger.LoadContext("data\lexical.ctx");
  26. /*
  27. m_dictCore.Load("data\Dict.dct");
  28. m_POSTagger.LoadContext("data\trainTest.ctx");
  29. */
  30. /*
  31. m_dictCore.AddItem("十分",'d'*256,500);
  32. m_dictCore.AddItem("十分",'m'*256,-500);
  33. m_dictCore.Save("data\coreDict.dct");
  34. */
  36. m_POSTagger.SetTagType();
  38. m_Person.Configure("data\Person",TT_PERSON);
  39. //Set the person recognition configure
  40. m_Transliteration.Configure("data\Trans",TT_TRANS);
  41. //Set the transliteration recognition configure
  42. m_Place.Configure("data\Place",TT_PLACE);
  43. //Set the place recognition configure
  44. m_nOperateType=2;//0:Only Segment;1: First Tag; 2:Second Type
  45. m_nOutputFormat=0;//0:PKU criterion;1:973 criterion; 2: XML criterion
  46. }
  48. CResult::~CResult()
  49. {
  50. //free buffer
  51. for(int i=0;i<MAX_SEGMENT_NUM;i++)
  52. {
  53. delete [] m_pResult[i];
  54. }
  55. delete m_pResult;
  57. }
  59. bool CResult::Output(PWORD_RESULT pItem, char *sResult,bool bFirstWordIgnore)
  60. {
  61. int i=0;
  62. char sTempBuffer[WORD_MAXLENGTH],sPOS[3];
  63. sPOS[2]=0;
  64. sResult[0]=0;
  65. if(bFirstWordIgnore)//Ignore first valid
  66. i=1;
  67. while(pItem[i].sWord[0]!=0&&pItem[i].nHandle!=CT_SENTENCE_END)//Not sentence ending flag
  68. {
  69. //Get the POS string
  70. if(m_nOutputFormat!=0)//Not PKU format
  71. PKU2973POS(pItem[i].nHandle,sPOS);
  72. else//PKU format
  73. {
  74. sPOS[0]=pItem[i].nHandle/256;
  75. sPOS[1]=pItem[i].nHandle%256;
  76. }
  77. sPOS[m_nOperateType]=0;//Set the sPOS with operate type
  79. if(m_nOutputFormat==0)//PKU format
  80. {
  81. sprintf(sTempBuffer,"%s",pItem[i].sWord);
  82.     strcat(sResult,sTempBuffer);
  83. if(sPOS[0]!=0)//need POS 
  84. {
  85. sprintf(sTempBuffer,"/%s",sPOS);
  86. strcat(sResult,sTempBuffer);
  87. }
  88.     strcat(sResult,"  ");
  89. }
  90. else if(m_nOutputFormat==1)//973 format
  91. {
  92. sprintf(sTempBuffer,"%s\",pItem[i].sWord);
  93.     strcat(sResult,sTempBuffer);
  94. if(sPOS[0]!=0)//need POS 
  95. {
  96. sprintf(sTempBuffer,"[%s]",sPOS);
  97. strcat(sResult,sTempBuffer);
  98. }
  99. }
  100. else if(m_nOutputFormat==2)//XML format
  101. {
  102. if(sPOS[0]!=0)//POS
  103. {
  104. sprintf(sTempBuffer,"<any type=42%s42>",sPOS);
  105. strcat(sResult,sTempBuffer);
  106. }
  107. sprintf(sTempBuffer,"<src>%s</src>",pItem[i].sWord);
  108. strcat(sResult,sTempBuffer);
  109. if(sPOS[0]!=0)
  110. {
  111. strcat(sResult,"</any>");
  112. }
  113. }
  114. i++;
  115. }
  116. return true;
  117. }
  119. bool CResult::Processing(char *sSentence,unsigned int nCount)
  120. {
  121. int nIndex;
  122. #if _ICT_DEBUG
  123. char *sSegment;
  124. sSegment=new char[MAX_SENTENCE_LEN*2];
  125. #endif
  126. m_Seg.Segment(sSentence,m_dictCore,nCount);
  128. m_nResultCount=m_Seg.m_nSegmentCount;
  129. //Record the number of result
  130. for(nIndex=0;nIndex<m_Seg.m_nSegmentCount;nIndex++)
  131. {
  132. m_POSTagger.POSTagging(m_Seg.m_pWordSeg[nIndex],m_dictCore,m_dictCore);
  133. #if _ICT_DEBUG
  134. Output(m_Seg.m_pWordSeg[nIndex],sSegment);
  135. printf("POS Tag%d:%sn",nIndex+1,sSegment);
  136. #endif
  137. m_Person.Recognition(m_Seg.m_pWordSeg[nIndex],m_Seg.m_graphOptimum,m_Seg.m_graphSeg,m_dictCore);
  138. m_Transliteration.Recognition(m_Seg.m_pWordSeg[nIndex],m_Seg.m_graphOptimum,m_Seg.m_graphSeg,m_dictCore);
  139. m_Place.Recognition(m_Seg.m_pWordSeg[nIndex],m_Seg.m_graphOptimum,m_Seg.m_graphSeg,m_dictCore);
  140. }
  141. //m_Person.Recognition(m_Seg.m_WordSeg[0],m_Seg.m_graphOptimum,m_Seg.m_graphSeg,m_dictCore);
  142. //Person Recognition
  143. #if _ICT_DEBUG
  144. printf("After person recognition.n");
  145. #endif
  146. m_Seg.OptimumSegmet(nCount);
  147. for(nIndex=0;nIndex<m_Seg.m_nSegmentCount;nIndex++)
  148. {
  149. m_POSTagger.POSTagging(m_Seg.m_pWordSeg[nIndex],m_dictCore,m_dictCore);
  150. #if _ICT_DEBUG
  151. Output(m_Seg.m_pWordSeg[nIndex],sSegment);
  152. printf("POS Tag%d:%sn",nIndex+1,sSegment);
  153. #endif
  154. }
  155. #if _ICT_DEBUG
  156. printf("After Sorting.n");
  157. #endif
  158. Sort();//Sort the ending 
  159. #if _ICT_DEBUG
  160. for(nIndex=0;nIndex<m_Seg.m_nSegmentCount;nIndex++)
  161. {
  162. Output(m_pResult[nIndex],sSegment);
  163. printf("POS Tag%d(P=Exp(%f)):%sn",nIndex+1,m_dResultPossibility[nIndex],sSegment);
  164. }
  165. delete [] sSegment;
  166. #endif
  167. return true;
  168. }
  169. //Sort the segmentation and POS result according its possibility
  170. bool CResult::Sort()
  171. {
  172. ELEMENT_TYPE dPossibility[MAX_SEGMENT_NUM],dTemp;
  173. int nIndex[MAX_SEGMENT_NUM],nTemp;//Index
  175. memset(dPossibility,0,sizeof(dPossibility));
  176. //Init the possibility
  178. for(int i=0;i<m_Seg.m_nSegmentCount;i++)
  179. {//Computing the possibility
  180. dPossibility[i]=ComputePossibility(m_Seg.m_pWordSeg[i]);
  181. nIndex[i]=i;//Record the index
  182. }
  184. //Sort with Bubble sort algorithm
  185. for(i=0;i<m_Seg.m_nSegmentCount;i++)
  186. for(int j=i+1;j<m_Seg.m_nSegmentCount;j++)
  187. {
  188. if(dPossibility[i]<dPossibility[j])
  189. {//Swap the possition and value
  190. nTemp=nIndex[i];
  191. dTemp=dPossibility[i];
  192. nIndex[i]=nIndex[j];
  193. dPossibility[i]=dPossibility[j];
  194. nIndex[j]=nTemp;
  195. dPossibility[j]=dTemp;
  196. }
  197. }
  199. for(i=0;i<m_Seg.m_nSegmentCount;i++)
  200. {//Adjust the segmentation and POS result and store them in the final result array
  201.  //Store them according their possibility ascendly
  202. Adjust(m_Seg.m_pWordSeg[nIndex[i]],m_pResult[i]);
  203. m_dResultPossibility[i]=dPossibility[i];
  204. }
  205. return true;
  206. }
  207. //Compute the possibility of current segmentation and POS result
  208. ELEMENT_TYPE CResult::ComputePossibility(PWORD_RESULT pItem)
  209. {
  210. int i=0;
  211. ELEMENT_TYPE dResultPossibility=0;
  212. while(pItem[i].sWord[0]!=0)
  213. {
  214. dResultPossibility+=pItem[i].dValue;
  215. //Compute the possibility of logP(Wi|Ti)
  216. if(pItem[i+1].sWord[0]!=0)//Not the last one
  217. {//Compute the possibility of logP(Ti|Ti-1)
  218. dResultPossibility+=log((double)(m_POSTagger.m_context.GetContextPossibility(0,pItem[i].nHandle,pItem[i+1].nHandle)+1));
  219. dResultPossibility-=log((double)(m_POSTagger.m_context.GetFrequency(0,pItem[i].nHandle)+1));
  220. }
  221. i++;
  222. }
  223. return dResultPossibility;
  224. }
  226. //Adjust the result with some rules
  227. bool CResult::Adjust(PWORD_RESULT pItem,PWORD_RESULT pItemRet)
  228. {
  229. int i=0,j=0;
  230. unsigned int nLen;
  231. char sSurName[10],sSurName2[10],sGivenName[10];
  232. bool bProcessed=false;//Have been processed
  233. while(pItem[i].sWord[0]!=0)
  234. {
  235. nLen=strlen(pItem[i].sWord);
  236. bProcessed=false;
  238. //Rule1: adjust person name
  239. if(pItem[i].nHandle==28274&&ChineseNameSplit(pItem[i].sWord,sSurName,sSurName2,sGivenName,m_Person.m_dict)&&strcmp(pItem[i].sWord,"叶利钦")!=0)//'nr'
  240. {//Divide name into surname and given name
  242. if(sSurName[0])
  243. {
  244. strcpy(pItemRet[j].sWord,sSurName);
  245. pItemRet[j++].nHandle=28274;
  246. }
  247. if(sSurName2[0])
  248. {
  249. strcpy(pItemRet[j].sWord,sSurName2);
  250. pItemRet[j++].nHandle=28274;
  251. }
  252. if(sGivenName[0])
  253. {
  254. strcpy(pItemRet[j].sWord,sGivenName);
  255. pItemRet[j++].nHandle=28274;
  256. }
  257. bProcessed=true;
  258. }
  259. //Rule2 for overlap words ABB 一段段、一片片
  260. else if(pItem[i].nHandle==256*'m'&&pItem[i+1].nHandle/256=='q'&&strcmp(pItem[i+1].sWord,pItem[i+2].sWord)==0)
  261. {
  262. strcpy(pItemRet[j].sWord,pItem[i].sWord);
  263. strcat(pItemRet[j].sWord,pItem[i+1].sWord);
  264. strcat(pItemRet[j].sWord,pItem[i+2].sWord);
  265. pItemRet[j].nHandle=256*'m';
  266. j+=1;
  267. i+=2;
  268. bProcessed=true;
  269. }
  270. //Rule3 for overlap words AA or AABB
  271. else if(nLen==2&&strcmp(pItem[i].sWord,pItem[i+1].sWord)==0)
  272. {
  273. strcpy(pItemRet[j].sWord,pItem[i].sWord);
  274. strcat(pItemRet[j].sWord,pItem[i+1].sWord);
  275.      //24832=='a'*256
  276. pItemRet[j].nHandle=24832;//a
  277. if(pItem[i].nHandle/256=='v'||pItem[i+1].nHandle/256=='v')//30208='v'8256
  278. {
  279. pItemRet[j].nHandle=30208;
  280. }
  281. if(pItem[i].nHandle/256=='n'||pItem[i+1].nHandle/256=='n')//30208='v'8256
  282. {
  283. pItemRet[j].nHandle='n'*256;
  284. }
  285. i+=1;
  286. if(strlen(pItem[i+1].sWord)==2)
  287. {//AAB:洗/洗/脸、蒙蒙亮
  288. if((pItemRet[j].nHandle==30208&&pItem[i+1].nHandle/256=='n')||
  289.    (pItemRet[j].nHandle==24832&&pItem[i+1].nHandle/256=='a')
  290.    )
  291. {
  292. strcat(pItemRet[j].sWord,pItem[i+1].sWord);
  293. i+=1;
  294. }
  295. }
  296. j+=1;
  297. bProcessed=true;
  298. }
  300. //Rule 4: AAB 洗/洗澡
  301. else if(nLen==2&&strncmp(pItem[i].sWord,pItem[i+1].sWord,2)==0&&strlen(pItem[i+1].sWord)==4&&(pItem[i].nHandle/256=='v'||pItem[i].nHandle/256=='a'))
  302. {
  303. strcpy(pItemRet[j].sWord,pItem[i].sWord);
  304. strcat(pItemRet[j].sWord,pItem[i+1].sWord);
  305.      //24832=='a'*256
  306. pItemRet[j].nHandle=24832;//'a'
  307. if(pItem[i].nHandle/256=='v'||pItem[i+1].nHandle/256=='v')//30208='v'8256
  308. {
  309. pItemRet[j].nHandle=30208;
  310. }
  312. i+=1;
  313. j+=1;
  314. bProcessed=true;
  315. }
  316. else if(pItem[i].nHandle/256=='u'&&pItem[i].nHandle%256)//uj,ud,uv,uz,ul,ug->u
  317. pItem[i].nHandle='u'*256;
  318. else if(pItem[i].nHandle/256=='s'&&pItem[i].nHandle%256=='s')//ss->nx
  319. pItem[i].nHandle='n'*256+'x';
  320. else if(pItem[i].nHandle==28275&&m_Transliteration.m_dict.IsExist(pItem[i+1].sWord,30))
  321. {
  322. strcpy(pItemRet[j].sWord,pItem[i].sWord);
  323. strcat(pItemRet[j].sWord,pItem[i+1].sWord);
  324. pItemRet[j].nHandle=28275;
  325. i+=1;
  326. j+=1;
  327. bProcessed=true;
  328. }
  329. if(!bProcessed)
  330. {//If not processed,that's mean: not need to adjust;
  331.  //just copy to the final result
  332. strcpy(pItemRet[j].sWord,pItem[i].sWord);
  333. pItemRet[j++].nHandle=pItem[i].nHandle;
  334. }
  335. i++;
  336. }
  337. pItemRet[j].sWord[0]=0;//Set ending
  338. return true;
  339. }
  341. //Paragraph Segment and POS Tagging
  342. bool CResult::ParagraphProcessing(char *sParagraph,char *sResult)
  343. {
  344. char *sSentence,sChar[3];
  345. char *sSentenceResult;
  346. unsigned int nLen=strlen(sParagraph)+13;
  347. sSentence=new char[nLen];//malloc buffer
  348. sSentenceResult=new char[nLen*3];//malloc buffer
  349. sSentence[0]=0;
  350. unsigned int nPosIndex=0,nParagraphLen=strlen(sParagraph),nSentenceIndex=0;
  351. sChar[2]=0;
  352. sResult[0]=0;//Init the result
  353. bool bFirstIgnore=true;
  354. strcpy(sSentence,SENTENCE_BEGIN);//Add a sentence begin flag
  355. while(nPosIndex<nParagraphLen)
  356. {//Find a whole sentence which separated by ! . n r
  357. sChar[0]=sParagraph[nPosIndex];//Get a char
  358. sChar[1]=0;
  359. if(sParagraph[nPosIndex]<0)
  360. {//double byte char
  361. nPosIndex+=1;
  362. sChar[1]=sParagraph[nPosIndex];
  363. }
  364. nPosIndex+=1;
  365. /*
  366. #define  SEPERATOR_C_SENTENCE "。！？：；…"
  367. #define  SEPERATOR_C_SUB_SENTENCE "、，（）“”‘’"
  368. #define  SEPERATOR_E_SENTENCE "!?:;"
  369. #define  SEPERATOR_E_SUB_SENTENCE ",()42'"
  370. #define  SEPERATOR_LINK "nr 　"
  371. */
  372. if(CC_Find(SEPERATOR_C_SENTENCE,sChar)||CC_Find(SEPERATOR_C_SUB_SENTENCE,sChar)||strstr(SEPERATOR_E_SENTENCE,sChar)||strstr(SEPERATOR_E_SUB_SENTENCE,sChar)||strstr(SEPERATOR_LINK,sChar))
  373. {//Reach end of a sentence.Get a whole sentence
  374. if(!strstr(SEPERATOR_LINK,sChar))//Not link seperator
  375. {
  376. strcat(sSentence,sChar);
  377. }
  378. if(sSentence[0]!=0)
  379. {
  380. if(!strstr(SEPERATOR_C_SUB_SENTENCE,sChar)&&!strstr(SEPERATOR_E_SUB_SENTENCE,sChar))
  381. strcat(sSentence,SENTENCE_END);//Add sentence ending flag
  383. Processing(sSentence,1);//Processing and output the result of current sentence.
  384. Output(m_pResult[0],sSentenceResult,bFirstIgnore);//Output to the imediate result
  385. //bFirstIgnore=true;
  386. strcat(sResult,sSentenceResult);//Store in the result buffer
  387. }
  388. if(strstr(SEPERATOR_LINK,sChar))//Link the result with the SEPERATOR_LINK
  389. {
  390. strcat(sResult,sChar);
  391. strcpy(sSentence,SENTENCE_BEGIN);//Add a sentence begin flag
  393. //sSentence[0]=0;//New sentence, and begin new segmentation
  394. //bFirstIgnore=false;
  395. }
  396. else if(strstr(SEPERATOR_C_SENTENCE,sChar)||strstr(SEPERATOR_E_SENTENCE,sChar))
  397. {
  398. strcpy(sSentence,SENTENCE_BEGIN);//Add a sentence begin flag
  399. //sSentence[0]=0;//New sentence, and begin new segmentation
  400. //bFirstIgnore=false;
  401. }
  402. else
  403. {
  404. strcpy(sSentence,sChar);//reset current sentence, and add the previous end at begin position
  405. }
  406. }
  407. else //Other chars and store in the sentence buffer
  408. strcat(sSentence,sChar);
  409. }
  410. if(sSentence[0]!=0&&strcmp(sSentence,SENTENCE_BEGIN)!=0)
  411. {
  412. strcat(sSentence,SENTENCE_END);//Add sentence ending flag
  413. Processing(sSentence,1);//Processing and output the result of current sentence.
  414. Output(m_pResult[0],sSentenceResult,bFirstIgnore);//Output to the imediate result
  415. strcat(sResult,sSentenceResult);//Store in the result buffer
  416. }
  417. delete []  sSentence;//FREE sentence buffer 
  418. delete []  sSentenceResult;//free buffer
  419. return true;
  420. }
  422. bool CResult::FileProcessing(char *sSourceFile,char *sResultFile)
  423. {
  424. FILE *fpSource,*fpResult;//The file pointer of read and write
  425. char *sParagraph,*sParagraphResult;
  426. sParagraph=new char[4*1024];
  427. sParagraphResult=new char[8*1024];
  428.     if((fpSource=fopen(sSourceFile,"rt"))==NULL)
  429. return false;//Cannot open the source file to read
  430.     if((fpResult=fopen(sResultFile,"wt"))==NULL) 
  431. return false;//Cannot open the result  file to write
  432. if(m_nOutputFormat==2)//XML format
  433. fprintf(fpResult,"<?xml version=42 1.042 encoding=42gb231242?><result>");
  434. while(!feof(fpSource))
  435. {
  436. if(fgets(sParagraph,4*1024,fpSource)==0)//Get a paragrah
  437. continue;
  438. ParagraphProcessing(sParagraph,sParagraphResult);
  439. fprintf(fpResult,"%s",sParagraphResult);
  440. }
  441. delete [] sParagraph;
  442. delete [] sParagraphResult;
  443. fclose(fpSource);
  444. if(m_nOutputFormat==2)//XML format
  445. fprintf(fpResult,"</result>");
  446. fclose(fpResult);
  447. return true;
  448. }
  450. bool CResult::PKU2973POS(int nHandle, char *sPOS973)
  451. {
  452. int nHandleSet[46]={24832,24932,24935,24942,25088,25344,25600,25703,25856,26112,26368,26624,26880,27136,27392,27648,27904,28160,28263,28274,28275,28276,28280,28282,28416,28672,28928,29184,29440,29696,29799,29952,30052,30055,30058,30060,30070,30074,30208,30308,30311,30318,30464,30720,30976,31232};
  453. //   "a", "ad","ag","an","b", "c", "d", "dg","e", "f","g", "h", "i", "j", "k", "l", "m", "n", "ng","nr","ns","nt","nx","nz","o", "p", "q", "r", "s", "t", "tg","u", "ud","ug","uj","ul","uv","uz","v", "vd","vg","vn","w", "x", "y", "z"
  454. char sPOSRelated[46][3]={"a", "ad","ga","an","f", "c", "d", "d", "e","nd","g", "h", "i", "j", "k", "l", "m", "n", "gn","nh","ns","ni","ws", "nz","o", "p", "q", "r", "nl","nt","gt","u", "ud","ug","uj","ul","uv","uz","v", "vd","gv","vn","w", "x", "u", "a"};
  455. /* "Bg","gf",
  456.  "Rg","gr",
  457.  "Mg","gm",
  458.  "Yg","u",
  459.  "Ug","u",
  460.  "Qg","q",
  461. */
  463. int nIndex=BinarySearch(nHandle,nHandleSet,46);
  464. if(nIndex==-1)
  465. strcpy(sPOS973,"@");
  466. else
  467. strcpy(sPOS973,sPOSRelated[nIndex]);
  468. return true;
  469. }
  471. bool CResult::ChineseNameSplit(char *sPersonName, char *sSurname, char *sSurname2, char *sGivenName, CDictionary &personDict)
  472. {
  473. int nSurNameLen=4,nLen=strlen(sPersonName),nFreq,i=0,nCharType;
  474. char sTemp[3];
  475. if(nLen<3||nLen>8)//Not a traditional Chinese person name
  476. return false;
  477. while(i<nLen)//No Including non-CHinese char
  478. {
  479. nCharType=charType((unsigned char*)sPersonName+i);
  480. if(nCharType!=CT_CHINESE&&nCharType!=CT_OTHER)
  481. return false;
  482. i+=2;
  483. }
  484. sSurname2[0]=0;//init 
  485. strncpy(sSurname,sPersonName,nSurNameLen);
  486. sSurname[nSurNameLen]=0;
  487. if(!personDict.IsExist(sSurname,1))
  488. {
  489. nSurNameLen=2;
  490. sSurname[nSurNameLen]=0;
  491. if(!personDict.IsExist(sSurname,1))
  492. {
  493. nSurNameLen=0;
  494. sSurname[nSurNameLen]=0;
  495. }
  496. }
  497. strcpy(sGivenName,sPersonName+nSurNameLen);
  498. if(nLen>6)
  499. {
  500. strncpy(sTemp,sPersonName+nSurNameLen,2);
  501. sTemp[2]=0;//Get the second possible surname
  502. if(personDict.IsExist(sTemp,1))
  503. {//Hongkong women's name: Surname+surname+given name
  504. strcpy(sSurname2,sTemp);
  505. strcpy(sGivenName,sPersonName+nSurNameLen+2);
  506. }
  507. }
  508. nFreq=personDict.GetFrequency(sSurname,1);
  509. if(nSurNameLen!=4&&((nSurNameLen==0&&nLen>4)||strlen(sGivenName)>4||(GetForeignCharCount(sPersonName)==3&&nFreq<personDict.GetFrequency("张",1)/4)||(nFreq<10&&GetForeignCharCount(sGivenName)==(nLen-nSurNameLen)/2)))
  510. return false;
  511. if(nLen==4&&m_Person.IsGivenName(sPersonName))
  512. {//Single Surname+given name
  513. return false;
  514. }
  515. return true;
  516. }