GenoPro Support Forum

Q: Where do I find (and edit) the texts (individuals/families) that appear after the counters of names in the index?

Anna

Edited: Monday, January 16, 2006 by Anna

The report generator uses the method Dic.PlurialCount("Individual", cIndividuals) or Dic.PlurialCount("Family", cFamilies).  You need to translate the following tags in Dictionary.xml.  Use the attribute P= for the plurial form if different from the default plurial.

OK, now the Swedish skin works. I've inserted plurals for sons, daughters, siblings etc in the dict, and added the swedish possessive forms for nouns in lang.

Q:The phrase during (period) a's occupation was... did not work out in swedish. I wish to rearrange the order of the terms, resulting in: A worked as ..... during...

So, how do I change the format from the basik form A to the possessive form A's? I've searched for the string "PhOccupation in lang to find where tio make the substiute, but is is not in that file?

The phrase PhOccupation is found in file individual.htm.  If you want to remove the possessive form, replace the line strRelative = StrPossessiveProperNoun(i.Name.Short) by strRelative = i.Name.Short.

In the future, I am planning to improve the phrase generator to have a built-in possessive set of rules and a new tag syntax such as:

Such a phrase would produce the following output: "Dan's car".  In French, the code Report.WritePhrase "{p0,1}", "Dan", "auto" would produce "L'auto de Dan".

Using this new improvement, removing the possessive form would be as simple as changing {p0,1} to {0,1}.  I think this will simplify the translation - as there would be no need to modify the VBScript code.

What a great idea!!

This way I'm sure there won't be any code changes!

A section describing the rules for possessive names would be a good solution.  In that section, you could write 14 rules for each of the 14 cases.

The question remains... What are the criterias for the rules?

EndWith - The noun ends with a given string.
Pattern - The noun matches the pattern.  For performance reasons, the pattern won't be a regular expression, but simple wildcards such as * and ?.  For instance, any noun starting with the letter "A" would have the pattern "A*" or any noun ending with "s" could have the pattern "*s".
EqualTo - The noun matches exactly the given string.  This would be good for a very specific exception.

Operations:
ReplaceWith - Replace the noun with a given string.
Append - Append a string to a given noun.

Anything else missing?

Technically, every rule could be described using the Pattern attribute, however it is simpler to read EndWith (or perhaps EndsWith) than reading a pattern with wildcards (* and ?).  Besides, a pattern requires more CPU processing (ie, slower) than a straight comparison.

Enjoy your time with your family... there is no rush.  I have plenty of work on my plate so this will give me a little break.  Besides, I need time to digest this information and think of how to implement the rules.