Hi all. Bit of a problem - hope somebody can help.
I am trying to return lists sorted alphabetically in my native language - Welsh.
a,b,c,ch,d,dd,e,f,ff,g,ng,h,i,j,l,ll,m,n,o,p,ph,r,rh,s,t,th,u,w,y (29 letters)
Note that there are 'double characters' - these are considered as single discrete letters.
Roman letters (k,q,v,x,z) can be added to produce this 'composite alphabet':
a,b,c,ch,d,dd,e,f,ff,g,ng,h,i,j,k,l,ll,m,n,o,p,ph,q,r,rh,s,t,th,u,v,w,x,y,z (34 letters)
In addition vowels (a,e,i,o,u,w,y) can be accented with grave, acute, umlaut and circumflex - these should be equivalent to the unaccented letters - i.e. â, à etc equivalent to 'a'.
This means that search results should be sorted as follows:
Due to 'ng' coming before 'm'.
Due to 'ch' coming after 'c'.
This has given me a real headache. I've tried placing a 'symbol' in front of 'double characters', but ended up making a right pig's ear of things. I would be grateful for any pointers. Note - this is not for an assignment/commercial purposes - just trying to implement corrections to search results.